Parallel Adaptive Arbiter for Improved CPU Utilization and Fair Bandwidth Allocation
نویسندگان
چکیده
Nowadays, task parallelism is recognized to be a huge challenge for future extreme scale computing system. Advancement in parallel computing system necessitates solving the bus contention in a most efficient manner along with high computation rate. An arbiter receives bus requests from master components to grant the bus access. Therefore, an arbiter plays an important role in solving the bus contention in any System-on-Chip (SoC). This article presents a new technique for arbitration called Parallel Adaptive Arbitration (PAA) to maximize the usage of CPU cores along with fair and moderate bus bandwidth allocation. This arbitration algorithm is developed for heterogeneous masters designed according to the different traffic behavior to enable high degree of task parallelization. The results reveal that PAA is more advantageous than the other conventional arbitration algorithms for several reasons including utilization of CPU cores up to its maximum extent using synchronization of heterogeneous masters. The proposed arbitration technique could be a promising approach for designing SoC for future applications.
منابع مشابه
An Accommodative Adaptive Arbitration Algorithm for Maximum CPU Utilization, Fair Bandwidth Allocation and Low Latency
An adaptive algorithm for fair bandwidth allocation, low latency and maximum CPU utilization is proved to be a promising approach for designing system-on-chip for future applications. Adaptive arbitration focuses on user oriented as well as system oriented performance therefore it is more advantageous then the other conventional arbitration algorithms for several reasons; these include fair ban...
متن کاملDesign and Performance Analysis of CBCS Packet Scheduling Algorithm
In active and programmable networks, packet processing could be accomplished in the router within the data path. For efficient resource allocation in such networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to the bandwidth to improve overall performance. The dynamic nature of network load and the inherent unpredictability of processing ...
متن کاملTrade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link
We propose Trade & Cap (T&C), an economicsinspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared resource (e.g., a DSLAM link) so as to converge on what they perceive to be an equitable allocation, while ensuring efficient resource utilization. Under T&C, rather than acting as an arbiter, an Internet Service Provider (ISP) acts as an ...
متن کاملCrossbar Arbiter Architecture for High-Speed MAPOS Switch
This paper describes a crossbar-switch arbiter for a high-speed MAPOS switch. The arbiter uses the following techniques suitable for variable-length frame switching: 1. parallel processing for handling requests from network interfaces and for resource allocation, 2. techniques such as release-on-request, fast back-to-back transfer, and request prefetching to reduce the arbitration overhead, and...
متن کاملFair Resource Allocation in Programmable and Active Networks Using a Composite Scheduler
In active and programmable networks, the packet scheduling schemes should consider multiple resources such as CPU and memory in addition to bandwidth to achieve overall fairness. Maintaining fairness of one resource allocation does not ensure the fair allocation of other resources automatically. The dynamic nature of network load, and the inherent unpredictability of processing times of active ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015